Speeding up the Discrete Log Computation on Curves with Automorphisms
نویسندگان
چکیده
منابع مشابه
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms
In this paper we present a new algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop in Miller’s algorithm using non-trivial efficient automorphisms. The proposed algorithm is as efficient as the algorithm in [12].
متن کاملSpeeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based cryptosystems but also as a building block for constructing cryptographic schemes with new and novel properties. Motivated by the work of Scott, we investigate how to use efficiently computable automorphisms to speed up pairing computations on two families of non-su...
متن کاملSpeeding up Exponentiation using an Untrusted Computational Resource
We present protocols for speeding up fixed-base exponentiation and variablebase exponentiation using an untrusted computation resource. In the fixed-base protocols, the base and exponent may be blinded. If the exponent is fixed, the base may be blinded in the variable-base exponentiation protocols. The protocols are the first ones for accelerating exponentiation with the aid of an untrusted res...
متن کاملA quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n)
Improving over an earlier construction by Kaye and Zalka [1], in [2] Maslov et al. describe an implementation of Shor’s algorithm, which can solve the discrete logarithm problem on ordinary binary elliptic curves in quadratic depth O(n). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log n). As technical tools we introduce quantum ci...
متن کاملOn Marginal Automorphisms of a Group Fixing the Certain Subgroup
Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...
متن کامل